From Partial Orders with Projections to Domains

Random Partial Orders Defined by Angular Domains

The d-dimensional random partial order is the intersection of d independently and uniformly chosen (with replacement) linear orders on the set [n] = {1, 2, . . . , n}. This is equivalent to picking n points uniformly at random in the d-dimensional unit cube Qd = [0, 1]d with the coordinate-wise ordering. If d = 2, then this can be rephrased by declaring that for any pair P1, P2 ∈ Q2 we have P1 ...

From Sazonov's Non-Dcpo Natural Domains to Closed Directed-Lub Partial Orders

Normann proved that the domains of the game model of PCF (the domains of sequential functionals) need not be dcpos. Sazonov has defined natural domains for a theory of such incomplete domains. This paper further develops that theory. It defines lub-rules that infer natural lubs from existing natural lubs, and lub-rule classes that describe axiom systems like that of natural domains. There is a ...

Extending Partial Orders to Dense Linear Orders

Domains with Approximating Projections

We investigate approximating posets with projections (approximating pop's). These are triples (D; ; P) consisting of a poset (D;) and a directed set P of projections with sup P = id D. They carry a canonical uniformity and thus a topology. We relate their properties such as completeness and compactness to properties of the poset and the projection set. We show that each monotone net in D is con...

Partial Parsing from Bitext Projections

Recent work has shown how a parallel corpus can be leveraged to build syntactic parser for a target language by projecting automatic source parse onto the target sentence using word alignments. The projected target dependency parses are not always fully connected to be useful for training traditional dependency parsers. In this paper, we present a greedy non-directional parsing algorithm which ...